Letter to the Editor—Stronger Cuts in Gomory's All-Integer Integer Programming Algorithm
نویسندگان
چکیده
منابع مشابه
Spherical cuts for integer programming problems
Abstract We introduce a new family of valid inequalities for general linear integer programming problems, based on the distance of the relaxed solution to the closest integral point. We show that these are valid cuts, establish some relations with Balas’ intersection cuts, and show that a straightforward cutting plane algorithm derived from either spherical or intersection cuts will in general ...
متن کاملLocal cuts for mixed-integer programming
A general framework for cutting-plane generation was proposed by Applegate et al. in the context of the traveling salesman problem. The process considers the image of a problem space under a linear mapping, chosen so that a relaxation of the mapped problem can be solved efficiently. Optimization in the mapped space can be used to find a separating hyperplane if one exists, and via substitution ...
متن کاملCuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructure...
متن کاملSemi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack problem is a relaxation of general mixed-integer programming. We show how strong inequalities valid for the semi-continuous knapsack polyhedron can be derived and used in a branch...
متن کاملFirefly Algorithm Applied to Integer Programming Problems
Firefly algorithm is a recently added member of the swarm intelligence heuristics family. In this paper the firefly algorithm is adjusted and applied to integer programming problems. In order to deal with integer programming problems, firefly algorithm rounds the parameter values to the closest integer after producing new solutions. The performance of firefly algorithm is tested on seven proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1967
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.15.1.155